Hamiltonian cycles in (2, 3, c)-circulant digraphs
نویسندگان
چکیده
Let D be the circulant digraph with n vertices and connection set {2, 3, c}. (Assume D is loopless and has outdegree 3.) Work of S.C. Locke and D.Witte implies that if n is a multiple of 6, c ∈ {(n/2) + 2, (n/2) + 3}, and c is even, then D does not have a hamiltonian cycle. For all other cases, we construct a hamiltonian cycle in D.
منابع مشابه
Decomposition of Circulants into Antidirected Hamilton Cycles
Let G = Gn(a1, a2, ..., ak) denote a directed circulant graph of order n with k pairwise distinct jumps [1]. Antidirected Hamilton cycle in G is a cycle of n arcs that does not contain induced directed path P2. Let C 1 G, C 2 G, ..., C k G be pairwise arc-disjoint antidirected Hamilton cycles in G, each composed of exactly two distinct jumps. We give the necessary and sufficient conditions for ...
متن کاملHamiltonian cycles in circulant digraphs with two stripes
The Circulant Travelling Salesman Problem (CTSP) is the problem of nding a minimum weight Hamiltonian cycle in a weighted graph with circulant distance matrix. The computational complexity of this problem is not known. In fact, even the complexity of deciding Hamiltonicity of the underlying graph is unkown. This paper presents necessary and suucient conditions for the existence of a Hamilto-nia...
متن کاملOn non-Hamiltonian circulant digraphs of outdegree three
We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is adjacent to two diametrically opposite vertices, or every vertex is adjacent to the vertex diametrically opposite to itself.
متن کاملDisjoint Hamiltonian Cycles in Recursive Circulant Graphs
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
متن کاملInfinite Circulant Digraphs and Random Infinite Circulant Digraphs
In this paper, we completely determine the connectivity of every infinite circulant digraphs and prove that almost all infinite circulant digraphs are infinitely strongly connected and therefore have both oneand two-way infinite Hamiltonian paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009